Tom and Jerry Based Multipath Routing with Optimal K-medoids for choosing Best Clusterhead in MANET

Given the unpredictable nature of a MANET, routing has emerged as major challenge in recent years. For effective it is necessary to establish both route discovery and best selection from among many routes. The primary focus this investigation on finding path for data transmission MANETs. In research, we provide an efficient technique minimising time spent passing between routers. Here, employ strategy based Tom Jerry Optimization (TJO) find via MANET's routers, called Ad Hoc On-Demand Distance Vector (AODV). AODV-TJO acronym stands suggested approach. This takes into account not just one but three goal functions: total number hops. When node or connection fails network, rerouting must be done. order prevent packet loss, MANET employs technique. Analyses AODV-efficacy TJO's are conducted, results presented terms energy use, end-to-end latency, bandwidth, well proportion living dead nodes. Vortex Search Algorithm (VSO) cuckoo search compared approach performance. Based findings, uses 580 J less than Cuckoo algorithm when used with 500